Approximate membership for regular languages modulo the edit distance
نویسندگان
چکیده
منابع مشابه
Top-Down Tree Edit-Distance of Regular Tree Languages
We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the editdistance d(L,R) between L and R to be the minimum edit-dis...
متن کاملApproximate String Searching under Weighted Edit Distance
Let p 2 be a string of length m and t 2 be a string of length n. The approximate string searching problem is to nd all approximate matches of p in t having weighted edit distance at most k from p. We present a new method that preprocesses the pattern into a DFA which scans t online in linear time, thereby recognizing all positions in t where an approximate match ends. We show how to reduce the ...
متن کاملPrefix Distance Between Regular Languages
The prefix distance between two words x and y is defined as the number of symbol occurrences in the words that do not belong to the longest common prefix of x and y. We show how to model the prefix distance using weighted transducers. We use the weighted transducers to compute the prefix distance between two regular languages by a transducer-based approach originally used by Mohri for an algori...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملMembership and Finiteness Problems for Rational Sets of Regular Languages
Let Σ be a finite alphabet. A set R of regular languages over Σ is called rational if there exists a finite set E of regular languages over Σ, such that R is a rational subset of the finitely generated semigroup (S, ·) = 〈E〉 with E as the set of generators and language concatenation as a product. We prove that for any rational set R and any regular language R ⊆ Σ∗ it is decidable (1) whether R ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.03.004